Sifting Shades
نویسندگان
چکیده
منابع مشابه
Shading Shades
Procedural material shaders continue to pop up since the advent of fragment programmability. Most of these shaders concentrate on interesting animated effects. The cg shades demo successfully explores the use of fragment shader programming for a different kind of materials: Highly repetitive, man-made materials. The given code shows a variety of implementation options adapted to different usage...
متن کاملLinear Sifting of Decision
Electronic copies of technical reports are available: Via FTP: URL ftp://ftp.informatik.uni-trier.de/pub/Users-Root/reports Via WWW: URL http://www.informatik.uni-trier.de/Reports/Current.html Via email: Send a mail to ftpmail@ftp.informatik.uni-trier.de, subject ’HELP’, for detailed instructions Printed copies: Trierer Forschungsberichte Fachbereich IV Mathematik / Informatik Universitat Trier ..
متن کاملLower Bound Sifting for MDDs
Decision Diagrams (DDs) are a data structure for the representation and manipulation of discrete logic functions often applied in VLSI CAD. Common DDs to represent Boolean functions are Binary Decision Diagrams (BDDs). Multiple-valued logic functions can be represented by Multiple-valued Decision Diagrams (MDDs). The efficiency of a DD representation strongly depends on the variable ordering; t...
متن کاملLinear Sifting of Decision Diagrams yChristoph
We propose a new algorithm, called linear sifting, for the optimization of decision diagrams that combines the ee-ciency of sifting and the power of linear transformations. We show that the new algorithm is applicable to large examples , and that in many cases it leads to substantially more compact diagrams when compared to simple variable reordering. We show in what sense linear transformation...
متن کاملA Model Sifting Problem of Selberg
We study a model sifting problem introduced by Selberg, in which all of the primes have roughly the same size. We show that the Selberg lower bound sieve is asymptotically optimal in this setting, and we use this to give a new lower bound on the sifting limit βκ in terms of the sifting dimension κ. We also show that one can use a rounding procedure to improve on the Selberg lower bound sieve by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Baylor University Medical Center Proceedings
سال: 2013
ISSN: 0899-8280,1525-3252
DOI: 10.1080/08998280.2013.11929029